Error Detection and Authentication in Quantum Key Distribution
نویسندگان
چکیده
منابع مشابه
Post-processing procedure for industrial quantum key distribution systems
We present algorithmic solutions aimed on post-processing for industrial quantum key distribution systems with hardware sifting. The main steps of the procedure are error correction, parameter estimation, and privacy amplification. Authentication of a classical public communication channel is also considered.
متن کاملMultiparty Secure Communication by Using Quantum Key Distribution Protocols
By using the order rearrangement of the single photon sequence and unitary transformations, a mult iparty controlled quantum communication scheme for Carrier Sense Multiple Access with Collision Detection(CSMA/CD) is presented .In this scheme, messages can only be recovered by the receivers with the permission of all controllers .It is shown that the security of messages transformat ion can be ...
متن کاملProvably Secure Quantum Key Distribution By Applying Quantum Gate
The need for Quantum Key Distribution (QKD) is strengthening due to its inalienable principles of quantum mechanics. QKD commences when sender transforms bits into qubits or quantum states by applying photon polarization and sends to the receiver. The qubits are altered when measured in incorrect polarization and cannot be reproduced according to quantum mechanics principles. BB84 protocol is t...
متن کاملSecured Communication Protocol via Encrypted Key Ensuring Message Integrity
The Secured communication protocol via encrypted key ensuring message integrity combination of Authentication of Third Party Authentication Quantum Key Distribute Protocol (implicit) and Third Party Authentication Quantum Key Distribute Protocol Mutual Authentication (explicit) quantum cryptography is used to provide authenticated secure communication between sender and Receiver. In quantum cry...
متن کاملPolar Codes for Quantum Key Distribution
The polar codes are a class of linear block error-correcting codes transmitted over symmetric binaryinput discrete memoryless channels [1, 2, 3]. As their length N, N = 2n, increases, their performance tends to the Shannon limit. Subsequent publications (e.g., [4, 5]) have addressed practical aspects of the polar codes such as the size length, N, of a polar code that can support a specific feas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001